privaci preserv linear discrimin analysi perturb data optim databas manag system continu manag larg data volum effici algorithm access manipul larg set sequenc requir provid accept perform advent object orient extens databas system solv problem contrari modern data model exacerb order manipul larg set complex object effici todai databas system manipul simpl record queri process algorithm softwar complex solid understand algorithm architectur issu essenti design databas manag softwar survei foundat design implement queri execut facil databas manag system describ wide arrai practic queri evalu techniqu relat post relat databas system includ iter execut complex queri evalu plan dualiti sort hash base set match algorithm type parallel queri execut implement special oper emerg databas applic domain search relev softwar chang artifact semant network semant network context search relev softwar engin artifact privaci preserv techniqu distanc dbase classif worst case privaci guarante measur interesting discov skew pattern data cube journal homepag www elsevi locat dss measur interesting discov skew pattern data cube dynam activ probe helpdesk databas helpdesk databas store past interact custom compani improv custom servic qualiti common scenario helpdesk databas find recommend exist problem custom custom provid incomplet inaccur inform manual prepar list clarif question work larg databas paper investig problem automat gener minim number question reach recommend paper propos dynam activ probe method compar altern decis tree case base reason method distinct featur activ probe custom inform reach recommend inform provid custom immedi method dynam gener question probe featur ensur inform custom method base probabilist model data augment method avoid overfit estim probabl model featur ensur method robust databas incomplet error experiment result verifi effect approach address divers user prefer sql dqueri dresult navig databas queri exploratori user find queri return answer irrelev exist work categor rank result user locat interest result success approach depend util user prefer exist work assum user user prefer real life user prefer paper propos step solut address divers issu user prefer categor approach propos solut requir explicit user involv step analyz queri histori user system offlin gener set cluster data type user prefer user ask queri step present user navig tree cluster gener step user easili select subset cluster match user brows rank categor result select cluster navig tree automat construct cost base algorithm consid cost visit intermedi node leaf node tree empir studi demonstr benefit approach categori subject descriptor semant integr knowledg discoveri environment research environment research knowledg discoveri requir extens data store sourc creat wai divers purpos describ metadata approach elicit semant inform environment data implement semanticsbas techniqu assist user integr navig mine multipl environment data sourc system specif environment data sourc relationship form user request augment semant relat data sourc automat present visual semant network addit present methodolog data navig pattern discoveri multi resolut brows data mine data semant captur util term pattern trend multipl level resolut present efficaci methodolog experiment result index structur match xml twig relat queri processor index structur propos speed evalu xml path express exist xml path indic su er limit focu index structur reli separ index node content simpl path express root leaf path tightli integr relat queri processor unifi framework compar index structur paper present framework defin famili index structur includ exist xml path indic propos index structur famili space time tradeo ectiv evalu xml branch path express twig condit show famili index structur implement access method underli databas system final present experiment evalu show perform tradeo index space match time experiment result show indic achiev order magnitud improv perform evalu twig queri albeit higher space cost previous propos xml path indic tightli integr relat queri processor semant integr knowledg discoveri environment research environment research knowledg discoveri requir extens data store sourc creat wai divers purpos describ metadata approach elicit semant inform environment data implement semanticsbas techniqu assist user integr navig mine multipl environment data sourc system specif environment data sourc relationship form user request augment semant relat data sourc automat present visual semant network addit present methodolog data navig pattern discoveri multi resolut brows data mine data semant captur util term pattern trend multipl level resolut present efficaci methodolog experiment result person visual handheld devic small screen size handheld mobil devic pose inher problem visual data difficult unpleas navig plethora present inform paper present approach person adapt content present handheld devic implement mobil financi applic system base tier architectur approach independ wireless network mobil devic util combin user profil data cluster visual techniqu fishey semant zoom enhanc understand data improv usabl devic navig rule explor larg multidimension data cube navig multidimension data cube nontrivi task line analyt process olap capabl view multidimension data rollup drill slice dice offer minim guidanc end user actual knowledg discoveri process articl address knowledg discoveri problem identifi pattern conceal multidimension data effect explor data cube present algorithm discoveri sk navig rule disnar discov hidden interest pattern form sk navig rule test skew pair current candid drill lattic node rule enhanc navig capabl illustr rule driven system extens experiment analysi show disnar algorithm discov interest pattern high recal precis small execut time low space overhead keyword cube navig data cube lattic olap navig rule skew privaci dpreserv techniqu euclidean distanc dbase mine algorithm fourier drelat transform detail inform individu credit health financi statu characterist purchas pattern person prefer routin record analyz varieti government commerci organ cronin privaci hoover digest index structur match xml twig relat queri processor index structur propos speed evalu xml path express exist xml path indic su er limit focu index structur reli separ index node content simpl path express root leaf path tightli integr relat queri processor unifi framework compar index structur paper present framework defin famili index structur includ exist xml path indic propos index structur famili space time tradeo ectiv evalu xml branch path express twig condit show famili index structur implement access method underli databas system final present experiment evalu show perform tradeo index space match time experiment result show indic achiev order magnitud improv perform evalu twig queri albeit higher space cost previous propos xml path indic tightli integr relat queri processor store xml xsd sql databas interplai logic physic design xml standard exchang queri inform enterpris busi xml data increasingli reli accompani xsd schema specif store xml xsd sql databas interplai logic physic design xml standard exchang queri inform enterpris busi xml data increasingli reli accompani xsd schema specif recent progress select topic databas research report young chines research work unit state gener substr select estim varieti set relat databas ldap web applic increas quickli accur estim count tupl ldap entri web document match boolean substr queri provid select estim correl occurr substr crucial select estim gener boolean queri studi previous prior work discuss extend appli case onedimension boolean queri exist method case multidimension conjunct queri approxim select explicitli store cross count frequent occur combin substr estim obtain pars queri multidimension substr store cross count appli probabilist formula major problem method number cross count store method increas exponenti number dimens space dimension explos due captur correl dimens limit amount space exist method reliabl give accur estim method gener boolean queri gracefulli present approach select estim gener boolean substr queri focu case conjunct multidimension boolean queri approach explicitli store cross count count twig match tree describ effici algorithm accur estim number match small node label tree twig larg node label tree summari data structur problem interest queri xml hierarch data provid queri feedback costbas queri optim summari data structur scalabl representsapproxim frequencyinform twiglet small twig data tree twig queri number match estim creat set queri twiglet combin complementari approach set hash estim number match queri twiglet maxim overlap combin queri twiglet estim estim twig queri propos estim algorithm appli approach queri twiglet form variat twiglet decomposit techniqu present extens experiment evalu real xml count twig match tree describ effici algorithm accur estim number match small node label tree twig larg node label tree summari data structur problem interest queri xml hierarch data provid queri feedback costbas queri optim summari data structur scalabl representsapproxim frequencyinform twiglet small twig data tree twig queri number match estim creat set queri twiglet combin complementari approach set hash estim number match queri twiglet maxim overlap combin queri twiglet estim estim twig queri propos estim algorithm appli approach queri twiglet form variat twiglet decomposit techniqu present extens experiment evalu real xml queri optim compress databas system lastd ecad es improv cpu speed outpac improv main memori isk access rate ord er magnitud enabl ofd ata compress techniqu improv perform ofd atabas system previou work scribe benefit compress numer attribut where store compress format ond isk abund amp stringvalu attribut relat schema work compress string attribut ad atabas context previou work suitablyad ess role queri optim queri execut dd eagerli compress read main memori dd lazili stai compress main memori compress ond emand paper present ectiv approach dd abas compress base lightweight attribut level compress techniqu propos hierarch ictionari encod ing strategi intellig select ectiv compress method string valu attribut show eager lazi compress strategi prod suboptim plan queri involv compress string attribut formal problem compressionawar queri optimizationand propos provabl optim fast heurist algorithm select queri plan relat schema compress attribut algorithm easili integr exist cost base queri optim experi tpc hd atad emonstr impact string compress method show import compress awar queri optim approach result speed exist approach algebra compress framework queri result decis support applic emerg environ requir sql queri result intermedi result ship client analysi present client low bandwidth connect sever storag restrict compress result queri effici transfer client side access paper explor varieti techniqu address issu fix method choos combin compress method statist semant inform queri result enhanc effect compress repres combin present framework compress plan form compos primit compress oper present optim algorithm enumer valid compress plan choos optim plan experi show techniqu achiev signific perform improv standard compress tool winzip select estim boolean queri varieti applic rang optim queri alphanumer attribut provid approxim count document queri term increas quickli reliabl estim number string tupl document match boolean queri boolean queri context consist substr predic compos boolean oper work estim select substr queri gener problem estim select boolean queri substr predic studi approach extract select estim relationship substr predic boolean queri store correl cornel jaguar system ad mobil predat 